Today's Question:  What does your personal desk look like?        GIVE A SHOUT

SEARCH KEYWORD -- Index search

  Interview Programming Problems Done Right

Introduction Why 37signals Doesn't Hire Programmers Based on Brainteasers and my comment on HN generated a lot of responses, so much so that I'm writing this post to properly explain the essence of a good (IMHO) interview programming problem. Pascal's Triangle Pascal's Triangle is a shortcut for getting coefficients most often used binomial probability. The root element is 1. Every other element is the sum of the one or two above it (diagonally left and diagonally right). There are severa...

   Interview,Programming problem,Pascal,Triangle     2012-01-06 09:46:43

  mysql_fetch_array(),mysql_fetch_assoc() and mysql_fetch_row()

In PHP MySQL mannual. There are three functions which need to be clarified for some users who may get confused when choosing which one to use to get the result. mysql_fetch_array() : by seeting the different parameters, there are three ways to return the result set. MYSQL_ASSOC(Result set with field names as the associative indexs.It means you can use the field name as the index to get value of the specified cell). MYSQL_NUM(Result set with field names as the number indices). Or MYSQL_BOTH(...

   PHP,MySQL,resultset,comparison,mysql_fet     2011-08-05 04:53:09

  Understand Virtual DOM

With the popularity of React, the internals and implementation of Virtual DOM has becoming top discussed topic in tech communities and interviews. This post will give an introduction of Virtual DOM and how to implement a simple Virtual DOM logic. How to understand Virtual DOM In early days, front end developers would update a webpage view based on the data status change(usually after making AJAX call). But it brings performance penalties when there is frequent update as it would cause page reflo...

   JAVASCRIPT,DOM,VIRTUAL DOM     2019-12-07 23:43:04

  Find the kth smallest number in an array

This is an classical question, the general solution to this question is first using sorting algorithm to sort the array, then get the kth number in the array, the complexity is O(nlogn), we can also use selective sort or head sort to, the complexity of selective sort is O(kn) and heap sort is O(nlogk). The better solution is to use quick sort to find the kth smallest number, the complexity is O(n), the worst case cost is O(n^2). But today we introduce one more solution which has the worst case c...

   Sort, Quick sort, Search,Smallest     2013-01-09 06:20:54

  Facebook appoints former Google engineer to improve its search function

Facebook has set up a new team to improve its search products, the team leader is Lars Rasmussen who was a former Google engineer..The team consists of more than 20 engineers which is led by Rasmussen. The main efforts are to achieve easier sorting for contents which are created by users on Facebook . This will help Facebook be a more powerful search engine, which not only allows the user to stay longer on Facebook, but also helps Facebook make more profits by selling keyword ads like ...

   Facebook,Search engine,Google,Like     2012-03-30 11:33:28

  6 amazing HTML5 animation effects

HTML5 is rapidly developed in WEB world, it puts all kinds of pressure to browser development, but at the same time it also brings us lots of unexpected page effects. If we can use some HTML5 elements on our web apps,  we may get different user experience. However, for HTML5, there are lots of places need to improved. The following HTML5 animation effects are very attractive. 1. HTML5 mouseover image effect This HTML5 animation effect can be used in photo gallery, users can preview the...

   HTML5,Animation     2012-11-20 10:32:52

  Can a === 1 && a === 2 && a === 3 be true in JavaScript?

Lots of you may be aware that there is famous interview question which asks whether a == 1 && a == 2 && a == 3 can be true in JavaScript. And the answer to this question is YES. The reason is that == will do a non-strict comparison which will evaluate a to a number and this provides the possibility of dynamically return the value when every time a is accessed. Have you ever wondered whether a === 1 && a === 2 && a === 3 can be true? At first glance, it seems this ...

   JAVASCRIPT,===,STRICT COMPARISON     2018-04-06 12:17:29

  How Google Utilizes Big Data for SERP

Google is an expert when it comes to big data. This is evident in their development of various techniques and open source tools which are used by the big data industry professionals. These tools and technique allow Google to sift through millions of different websites and enormous amounts of data in order to provide users with correct answers in a matter of milliseconds. But how does Google accomplish that with such precision? To answer that, we need to focus on the complex activities that go o...

   GOOGLE,BIG DATA     2017-05-31 16:13:03

  Android 4.0+ occupies quarter of Android market

Google updates its developer page about Android platform version market share. From the latest data, we can find Android 4.0 and above system occupy around 25% of all Android market. But Android 2.3 Gingerbread still occupies over 50% of Android market. From the above chart, Android 4.0 has 23.7% market share, the latest Android 4.1 JellyBean takes 1.8%, these two have 25.5% market share in total. But Android 2.3 Gingerbread alone still dominates the Android market, it takes 55.8% market share....

   Google,Android,Share     2012-10-02 19:22:19

  GET, POST, and safely surfacing more of the web

As the web evolves, Google’s crawling and indexing capabilities also need to progress. Weimproved our indexing of Flash, built a more robust infrastructure called Caffeine, and we even started crawling forms where it makes sense. Now, especially with the growing popularity of JavaScript and, with it, AJAX, we’re finding more web pages requiring POST requests -- either for the entire content of the page or because the pages are missing information and/or look completely br...

   HTML,Get,Post,Form,SEO,Index,Search engine     2011-11-02 12:48:47

RECENT